-
1 factorization sequence
Большой англо-русский и русско-английский словарь > factorization sequence
-
2 factorization sequence
Математика: последовательность факторизацииУниверсальный англо-русский словарь > factorization sequence
-
3 factorization sequence
English-Russian scientific dictionary > factorization sequence
-
4 sequence
1) очерёдность; порядок следования3) геол. стратиграфический разрез4) серия, комплекс•- absolutely divergent sequence - absolutely limited sequence - absolutely summable sequence - absolutely unbiased sequence - adjusted homology sequence - asymptotically convergent sequence - asymptotically isotropic sequence - asymptotically lattice sequence - compactly divergent sequence - completely reversible sequence - conditionally divergent sequence - decimal geometric sequence - delicately divergent sequence - discretely convergent sequence - essentially convergent sequence - essentially finite sequence - essentially periodic sequence - everywhere dense sequence - infinitely large sequence - infinitely proceeding sequence - infinitely small sequence - integral stationary sequence - inverse sequence - inverted sequence - linearly independent sequence - locally convergent sequence - metrically convergent sequence - metrically transitive sequence - monotonically decreasing sequence - monotonically increasing sequence - never increasing sequence - numerical sequence - projectively realizable sequence - properly divergent sequence - rapid acquisition sequence - rapidly decreasing sequence - rapidly increasing sequence - recursively defined sequence - recursively divergent sequence - recursively enumerable sequence - relatively compact sequence - sequence of prime numbers - sequence of principal indices - slowly decreasing sequence - slowly increasing sequence - slowly oscillating sequence - stochastically compact sequence - stochastically stable sequence - strictly increasing sequence - strictly measurable sequence - strictly monotonic sequence - strongly convergent sequence - strongly downward sequence - strongly stationary sequence - strongly summable sequence - totally increasing sequence - totally monotone sequence - two-taile sequence - two-way infinite sequence - unconditionally divergent sequence - uniformly divergent sequence - uniformly integrable sequence - weakly convergent sequence -
5 последовательность факторизации
Русско-английский научно-технический словарь Масловского > последовательность факторизации
-
6 последовательность факторизации
Большой англо-русский и русско-английский словарь > последовательность факторизации
-
7 последовательность факторизации
Mathematics: factorization sequenceУниверсальный русско-английский словарь > последовательность факторизации
-
8 algorithm
алгоритм (cryptoalgorithm) криптографический алгоритм, криптоалгоритм; алгоритм шифрования (криптографического закрытия)- private cryptographic algorithmАнгло-русский словарь по компьютерной безопасности > algorithm
-
9 graph
1) граф2) график || строить график3) диаграмма || чертить диаграмму•- alternating composition graph - arbitrarily transversable graph - derived graph - doubly connected graph - doubly transitive graph - fully connected graph - locally countable graph - locally finite graph - locally restricted graph - log-log graph - partially labeled graph - partially orderable graph - progressively finite graph - regressively finite graph - strictly weak graph - strongly orientable graph - strongly regular graph - strongly rigid graph - strongly singular graph - strongly smooth graph - totally inductive graph - triangleless graph - triply transitive graph - uniquely intersectable graph - uniquely representable graph - weakly disconnected graph
См. также в других словарях:
Factorization lemma — In measure theory, the factorization lemma allows us to express a function f with another function T if f is measurable with respect T . An application of this is regression analysis.TheoremLet T:Omega ightarrowOmega be a function of a set Omega… … Wikipedia
Weierstrass factorization theorem — In mathematics, the Weierstrass factorization theorem in complex analysis, named after Karl Weierstrass, asserts that entire functions can be represented by a product involving their zeroes. In addition, every sequence tending to infinity has an… … Wikipedia
Fermat's factorization method — is based on the representation of an odd integer as the difference of two squares: :N = a^2 b^2. That difference is algebraically factorable as (a+b)(a b); if neither factor equals one, it is a proper factorization of N .Each odd number has such… … Wikipedia
Sylvester's sequence — In number theory, Sylvester s sequence is a sequence of integers in which each member of the sequence is the product of the previous members, plus one. The first few terms of the sequence are::2, 3, 7, 43, 1807, 3263443, 10650056950807,… … Wikipedia
Cycle detection — This article is about iterated functions. For another use, see Cycle detection (graph theory). In computer science, cycle detection is the algorithmic problem of finding a cycle in a sequence of iterated function values. For any function ƒ that… … Wikipedia
Prime number — Prime redirects here. For other uses, see Prime (disambiguation). A prime number (or a prime) is a natural number greater than 1 that has no positive divisors other than 1 and itself. A natural number greater than 1 that is not a prime number is… … Wikipedia
Pollard's rho algorithm — is a special purpose integer factorization algorithm. It was invented by John Pollard in 1975. It is particularly effective at splitting composite numbers with small factors.Core ideasThe rho algorithm is based on Floyd s cycle finding algorithm… … Wikipedia
Least common multiple — In arithmetic and number theory, the least common multiple (also called the lowest common multiple or smallest common multiple) of two integers a and b, usually denoted by LCM(a, b), is the smallest positive integer that is a multiple of both a… … Wikipedia
Singular value decomposition — Visualization of the SVD of a 2 dimensional, real shearing matrix M. First, we see the unit disc in blue together with the two canonical unit vectors. We then see the action of M, which distorts the disk to an ellipse. The SVD decomposes M into… … Wikipedia
Williams' p + 1 algorithm — In computational number theory, Williams p + 1 algorithm is an integer factorization algorithm, one of the family of algebraic group factorisation algorithms. It was invented by Hugh C. Williams in 1982. It works well if the number N to be… … Wikipedia
Factorial — n n! 0 1 1 1 2 2 3 6 4 24 5 120 6 720 7 … Wikipedia